Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
نویسندگان
چکیده
This paper deals with two kinds of the one-dimensional global optimization problems over a closed finite interval: (i) the objective function f(x) satisfies the Lipschitz condition with a constant L; (ii) the first derivative of f(x) satisfies the Lipschitz condition with a constant M . In the paper, six algorithms are presented for the case (i) and six algorithms for the case (ii). In both cases, auxiliary functions are constructed and adaptively improved during the search. In the case (i), piece-wise linear functions are constructed and in the case (ii) smooth piece-wise quadratic functions are used. The constants L and M either are taken as values known a priori or are dynamically estimated during the search. A recent technique that adaptively estimates the local Lipschitz constants over different zones of the search region is used to accelerate the search. A new technique called the local improvement is introduced in order to accelerate the search in both cases (i) and (ii). The algorithms are described in a unique framework, their properties are studied from a general viewpoint, and convergence conditions of the proposed algorithms are given. Numerical experiments executed on 120 test problems taken from the literature show quite a promising performance of the new accelerating techniques.
منابع مشابه
A univariate global search working with a set of Lipschitz constants for the first derivative
In the paper, a global optimization problem is considered where the objective function f(x) is univariate, black-box, and its first derivative f (x) satisfies the Lipschitz condition with an unknown Lipschitz constant K. In the literature, there exist methods solving this problem by using an a priori given estimate of K, its adaptive estimates, and adaptive estimates of local Lipschitz constant...
متن کاملPOINT DERIVATIONS ON BANACH ALGEBRAS OF α-LIPSCHITZ VECTOR-VALUED OPERATORS
The Lipschitz function algebras were first defined in the 1960s by some mathematicians, including Schubert. Initially, the Lipschitz real-value and complex-value functions are defined and quantitative properties of these algebras are investigated. Over time these algebras have been studied and generalized by many mathematicians such as Cao, Zhang, Xu, Weaver, and others. Let be a non-emp...
متن کاملAn effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients
متن کامل
Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants
In this paper, the global optimization problem miny∈S F (y) with S being a hyperinterval in R and F (y) satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function F (y) can be multiextremal, non-differentiable, and given as a ‘black-box’. To attack the problem, a new global optimization algorithm based on the following two ideas is prop...
متن کاملQuasicompact and Riesz unital endomorphisms of real Lipschitz algebras of complex-valued functions
We first show that a bounded linear operator $ T $ on a real Banach space $ E $ is quasicompact (Riesz, respectively) if and only if $T': E_{mathbb{C}}longrightarrow E_{mathbb{C}}$ is quasicompact (Riesz, respectively), where the complex Banach space $E_{mathbb{C}}$ is a suitable complexification of $E$ and $T'$ is the complex linear operator on $E_{mathbb{C}}$ associated with $T$. Next, we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 23 شماره
صفحات -
تاریخ انتشار 2013